Bounding network spectra for network design
نویسنده
چکیده
The identification of the limiting factors in the dynamical behavior of complex systems is an important interdisciplinary problem which often can be traced to the spectral properties of an underlying network. By deriving a general relation between the eigenvalues of weighted and unweighted networks, here I show that for a wide class of networks the dynamical behavior is tightly bounded by few network parameters. This result provides rigorous conditions for the design of networks with predefined dynamical properties and for the structural control of physical processes in complex systems. The results are illustrated using synchronization phenomena as a model process. PACS numbers: 89.75.-k, 05.45.Xt, 87.18.Sn
منابع مشابه
A Sociological Study on the Effect of the Facebook for Bounding Social Capital among the Youth
Face book is virtual and cybernetic network which causes an effective force and among the youth. It shows that if the usage of the face book network increases at home the rate of the interaction and the bounding social capital decreases as well. It also indicates that the effect of face book usage among the young people has increased already. Through a questionnaire by a survey method, more tha...
متن کاملNetwork Optimization with Concave Costs
In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.
متن کاملRemoval of Methylene Blue, Malachite Green and Rhodamine B in a Ternary System by Pistachio Hull; Application of Wavelet Neural Network Modeling and Doehlert Design
Most of previous papers in the field of dye removal used one dye or dyes with nearly separate spectra that simplifies dyes concentration determination by Beer's law at different λmax. In many real situations, dyes with highly overlapped spectra exist and their concentrations can be determined by multivariate analysis methods. In this study, principal component-wavelet neural network (PC-WNN) wa...
متن کاملNetwork Optimization with Concave Costs
In this paper the problem of minimum cost communication network design is considered where the costs are piecewise linear concave. Several methods are compared: Simulated Annealing method, a heuristic based on the method proposed by Minoux, and a lagrangian method based on lower bounding procedure.
متن کاملAN ANT COLONY SYSTEM ALGORITHM FOR THE TIME DEPENDENT NETWORK DESIGN PROBLEM
Network design problem is one of the most complicated and yet challenging problems in transportation planning. The Bi-level, non-convex and integer nature of network design problem has made it into one of the most complicated optimization problems. Inclusion of time dimension to the classical network design problem could add to this complexity. In this paper an Ant Colony System (ACS) has been ...
متن کامل